Random Strings and Truth-table Degrees of Turing Complete C.e. Sets
نویسندگان
چکیده
We investigate the truth-table degrees of (co-)c.e. sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truthtable completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the degree 0, even within the c.e. truth-table degrees, but when taking the meet over all such truth-table degrees, the infinite meet is indeed 0. The latter result proves a conjecture of Allender, Friedman and Gasarch. We also show that there are two Turing complete c.e. sets whose truth-table degrees form a minimal pair.
منابع مشابه
Random strings and tt-degrees of Turing complete C.E. sets
We investigate the truth-table degrees of (co-)c.e. sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table completeness depends on the choice of universal machine. We show that for such sets of random strings, any finite set of their truth-table degrees do not meet to the ...
متن کاملComputability, Traceability and Beyond
This thesis is concerned with the interaction between computability and randomness. In the first part, we study the notion of traceability. This combinatorial notion has an increasing influence in the study of algorithmic randomness. We prove a separation result about the bounds on jump traceability, and show that the index set of the strongly jump traceable computably enumerable (c.e.) sets is...
متن کاملHypersimplicity and semicomputability in the weak truth table degrees
We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. Moreover, we consider the sets that are both hypersimple an...
متن کاملLimit Computable Sets and Degrees
This paper will study sets and degrees containing sets that are determined as limits of computable approximations. By the Shoenfield Limit Lemma, the limit computable sets are precisely the degrees below ∅′. In particular, the paper will study limit computable sets by classifying them according to bounds to the number of changes to elements in various approximations of the sets. This leads to t...
متن کاملInterpreting True Arithmetic in the ∆2-Enumeration Degrees
When working with a mathematical structure, it is natural to ask how complicated the first order theory of the structure is. In the case of structures that can be interpreted in first order arithmetic, this is equivalent to asking if the theory is as complex as possible, namely is it as complex as first order arithmetic. Restricting our attention to the language of partial orders, ≤, there have...
متن کامل